Local theorems related to Lévy-type branching mechanism
نویسندگان
چکیده
منابع مشابه
Local Theorems Related to Lévy-type Branching Mechanism
We prove local limit theorems for the total mass processes of two branchingfluctuating particle systems which converge to discontinuous (2, d, β)-superprocess. To this end, we establish new subtle properties of the total mass for this class of superprocesses. Thus, the density of its absolutely continuous component exhibits a polynomial blow-up at the origin and has a regularly varying upper ta...
متن کاملCentral limit theorems for the L 2 norm of increments of local times of Lévy processes ∗
Let X = {Xt, t ∈ R+} be a symmetric Lévy process with local time {Lt ; (x, t) ∈ R × R +}. When the Lévy exponent ψ(λ) is regularly varying at zero with index 1 < β ≤ 2, and satisfies some additional regularity conditions, lim t→∞ ∫∞ −∞(L x+1 t − Lt ) dx− E (∫∞ −∞(L x+1 t − Lt ) dx ) t √ ψ−1(1/t) L = (8cψ,1) 1/2 (∫ ∞ −∞ ( Lβ,1 )2 dx )1/2 η, where Lβ,1 = {Lβ,1 ; x ∈ R} denotes the local time, at ...
متن کاملMarkov Branching Diffusions: Martingales, Girsanov Type Theorems and Applications to the Long Term Behaviour
Consider a spatial branching particle process where the underlying motion is a conservative diiusion on D R d corresponding to the elliptic operator L on D, and the branching is strictly binary (dyadic), with spatially varying rate (x) 0 (and 6 6 0) which is assumed to be bounded from above. We prove that, under extremely mild circumstances the process exhibits local extinction if and only if c...
متن کاملLévy processes and continuous - state branching processes : part I
Let us begin by recalling the definition of two familiar processes, a Brownian motion and a Poisson process. A real-valued process B = {B t : t ≥ 0} defined on a probability space (Ω, F , P) is said to be a Brownian motion if the following hold: (i) The paths of B are P-almost surely continuous. (ii) P(B 0 = 0) = 1. (iii) For 0 ≤ s ≤ t, B t − B s is equal in distribution to B t−s. (iv) For 0 ≤ ...
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications on Stochastic Analysis
سال: 2007
ISSN: 0973-9599
DOI: 10.31390/cosa.1.3.04